Expressive power of monadic logics on words, trees, pictures, and graphs
نویسندگان
چکیده
We give a survey of the expressive power of various monadic logics on specific classes of finite labeled graphs, including words, trees, and pictures. Among the logics we consider, there are monadic secondorder logic and its existential fragment, the modal mu-calculus, and monadic least fixed-point logic. We focus on nesting-depth and quantifier alternation as a complexity measure of these logics.
منابع مشابه
Comparing the Succinctness of Monadic Query Languages over Finite Trees
We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than mona...
متن کاملA Landscape of Logics for Finite Unordered Unranked Trees
In this paper we study a large number of logics to define languages of unordered unranked trees and compare their expressive power. Generally speaking, the logics we consider stem from three non-disjoint areas: logics related to automata theory, logics discussed in descriptive complexity theory, and second-order logics. The basic logic from automata theory is monadic second-order logic. Two ext...
متن کاملOn the Expressive Power of Modal Logics on Trees
Various logical languages are compared regarding their expressive power with respect to models consisting of nitely bounded branching in nite trees The basic multimodal logic with backward and forward necessity operators is equivalent to restricted rst order logic by adding the binary temporal operators since and until we get the expressive power of rst order logic on trees Hence restricted pro...
متن کاملAutomata Theory on Trees and Partial Orders
The paper reviews recent results which aim at generalizing nite automata theory from words and trees to labelled partial orders (presented as labelled directed acyclic graphs), with an emphasis on logical aspects. As an important type of labelled partial order we consider pictures (two-dimensional words). Graph acceptors and their specialization for pictures, \tiling systems", are presented, an...
متن کاملExpressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
We study the expressive power and succinctness of orderinvariant sentences of first-order (FO) and monadic second-order (MSO) logic on graphs of bounded tree-depth. Order-invariance is undecidable in general and, therefore, in finite model theory, one strives for logics with a decidable syntax that have the same expressive power as orderinvariant sentences. We show that on graphs of bounded tre...
متن کامل